Efficiency of simulation in monotone hyper-stable queueing networks
نویسندگان
چکیده
منابع مشابه
Efficiency of simulation in monotone hyper-stable queueing networks
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ensures that such efficiency is of the order of the coupling time (or meeting time) of two extremal sample paths. In the context of approximate sampling, it is given by the mixin...
متن کاملMonotone control of queueing networks
This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast to Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space (not just control directions), arrival routing problems, and certain uncontrolled service rates....
متن کاملSimulation studies of multiclass queueing networks
Multiclass queueing networks have been used to model communication and complex manufacturing systems. Recent results have shown that these networks can be unstable in the sense that the total number of jobs in the network explodes as time tends to in®nity even if the trac intensity at each station is less than unity. Simulation is used to demonstrate these unusual phenomena. Conjectures based ...
متن کاملAdaptive Importance Sampling Simulation of Queueing Networks
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a function of the content of the buffers, and the change of measure is determined using a cross-entr...
متن کاملDiffusion Parameters of Flows in Stable Queueing Networks
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes the system stable. An example is a generalized Jackson network with load less than unity and any work conserving policy. We find a simple diffusion limit for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2013
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-013-9357-7